Solving Multi-Objective Combinatorial Optimisation with Metaheuristics
نویسنده
چکیده
It is well known that, on the one hand, combinatorial optimization (CO) provides a powerful tool to formulate and model many optimization problems, on the other hand, a multi-objective (MO) approach is often a realistic and efficient way to treat many real world applications. Nevertheless, until recently, Multi-Objective Combinatorial Optimization (MOCO) did not receive much attention in spite of its potential applications [4] .
منابع مشابه
Metaheuristics for multiobjective optimisation - Cooperative approaches, uncertainty handling and application in logistics
This is a summary of the author’s PhD thesis supervised by Laetitia Jourdan and El-Ghazali Talbi and defended on 8 December 2009 at the Université Lille 1. The thesis is written in French and is available from http://sites.google.com/ site/arnaudliefooghe/. This work deals with the design, implementation and experimental analysis of metaheuristics for solving multiobjective optimisation problem...
متن کاملThe efficiency of indicator-based local search for multi-objective combinatorial optimisation problems
In the last few years, a significant number of multi-objective metaheuristics have been proposed in the literature in order to address real-world problems. Local search methods play a major role in many of these metaheuristic procedures. In this paper, we adapt a recent and popular indicator-based selection method proposed by Zitzler and Künzli in 2004, in order to define a population-based mul...
متن کاملGuided Local Search: An Illustrative Example in Function Optimisation
Guided Local Search originally proposed by Voudouris and Tsang [29] is a general optimisation technique suitable for a wide range of combinatorial optimisation problems. Successful applications of the technique so far include practical problems such as Frequency Allocation [29], Workforce Scheduling [28] and Vehicle Routing [2, 18] and also classic problems such as the Travelling Salesman Probl...
متن کاملCombining Hybrid Metaheuristics and Populations for the Multiobjective Optimisation of Space Allocation Problems
Some recent successful techniques to solve multiobjective optimisation problems are based on variants of evolutionary algorithms and use recombination and self-adaptation to evolve the population. We present an approach that incorporates a population of solutions into a hybrid metaheuristic with no recombination. The population is evolved using self-adaptation, a mutation operator and an inform...
متن کاملMetaheuristics for dynamic combinatorial optimization problems
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natu...
متن کامل